Geographic Routing in the Presence of Location Errors

نویسندگان

  • Sungoh Kwon
  • Ness B. Shroff
چکیده

In this paper, we propose a new geographic routing algorithm that alleviates the effect of location errors on routing in wireless ad hoc networks. In most previous work, geographic routing has been studied assuming perfect location information. However, in practice there could be significant errors in obtaining location estimates, even when nodes use GPS. Hence, existing geographic routing schemes will need to be appropriately modified. We investigate how such location errors affect the performance of geographic routing strategies. We incorporate location errors into our objective function by considering both transmission failures and backward progress. Each node then forwards packets to the node that maximizes this objective function. We call this strategy “Maximum Expectation within transmission Range” (MER). Simulation results with MER show that accounting for location errors significantly improves the performance of geographic routing. Our analysis also shows that our algorithm works well up to a critical threshold of error. We also show that MER is robust to the location error model and model parameters. Further, via simulations, we show that in a mobile environment MER performs better than existing approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological Cluster-based Geographic Routing in Multihop Ad Hoc Networks

Existing geographic routing algorithms face serious challenges due to location errors, nonplanarity issues and overhead of location service. To solve these issues, we propose Topological Cluster Based Geographic Routing that combines topology-based routing and geographic routing. It is a localized routing scheme where the geographic routing is performed on an overlay network of topological clus...

متن کامل

Anonymizing Geographic Ad Hoc Routing for Preserving Location Privacy

Due to the utilization of location information, geographic ad hoc routing presents superiority in scalability compared with traditional topology-based routing in mobile ad hoc networks. However, the consequent solicitation for location presence incurs severe concerns of location privacy, which has not been properly studied. In this paper, we attempt to preserve location privacy based on the ide...

متن کامل

Energy Efficient Geographic Routing Resilient to Location Errors

The thesis first analyses the importance sensor placement has in a large scale WSN application using geographic routing. A simulation-based topological study is made for a forest fire prevention application using both deterministically and randomly placed nodes. Sensor deployment can be projectile, from the network edge, made through manual scattering or by air release. Results reveal the impac...

متن کامل

A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks

Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node localization in practice however is not exact. Errors ranging from several centimeters up to several meters are usual. How to perform localized routing in practice when such errors are prevalent? In this work we look at a...

متن کامل

Modeling and analyzing the correctness of geographic face routing under realistic conditions

Geographic protocols are very promising for wireless ad hoc and sensor networks due to the low state storage and low message overhead. Under certain idealized conditions, geographic routing – using a combination of greedy forwarding and face routing – has been shown to work correctly and efficiently. In this work we model and analyze the correctness of geographic routing under non-ideal realist...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005